Honeycomb recipe

Honeycomb Arrays

A honeycomb array is an analogue of a Costas array in the hexagonal grid; they were first studied by Golomb and Taylor in 1984. A recent result of Blackburn, Etzion, Martin and Paterson has shown that (in contrast to the situation for Costas arrays) there are only finitely many examples of honeycomb arrays, though their bound on the maximal size of a honeycomb array is too large to permit an ex...

Honeycomb Subdivision

In this paper, we introduce a new subdivision scheme which we call honeycomb subdivision. After one iteration of the scheme each vertex becomes exactly 3-valent and with consecutive applications regular regions strongly resembles a honeycomb. This scheme can be considered as a dual for triangle schemes. The major advantage of the new scheme is that it creates a natural looking mesh structure.

Honeycomb Topologies

An increased use of free form surfaces in design often results to mass customised components and structural systems which are complex to assemble and expensive to produce. Often to resolve these forms, a tessellation algorithm is used to break the geometry down to manageable components which can be fabricated individually. The issue that can arise is the production of ...

RoboEarth Action Recipe Execution

The ability of reusing existing task execution plans is an important step towards autonomous behavior. Today, the reuse of sophisticated services allowing robots to act autonomous is usually limited to identical robot platforms and to very similar application scenarios. The approach presented in this paper proposes a way to mitigate this limitation by storing and reusing task plans on a global ...

Orange and Sunlight: A Recipe for Blisters